The Black-and-White Coloring Problem on Chordal Graphs
نویسندگان
چکیده
منابع مشابه
The Black-and-White Coloring Problem on Chordal Graphs
Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. This problem is known to be NPcomplete in general. We provide here a polynomial time algorithm for chordal graphs. Submitted: September 2009 Review...
متن کاملThe Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B| = b and |W| = w such that no vertex in B is adjacent to any vertex inW. In this paper we show that the problem is polynomial when restricted to cographs, distance-hereditary graphs, interval graphs and strongly chordal graphs. We show that the problem is NP-c...
متن کاملThe black-and-white coloring problem on permutation graphs
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B| = b and |W| = w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to permutation graphs.
متن کاملThe Black-and-White Coloring Problem on Trees
Given a graph G and positive integers b and w, the black-and-white coloring problem asks about the existence of a partial vertex-coloring of G, with b vertices colored black and w white, such that there is no edge between a black and a white vertex. We suggest an improved algorithm for solving this problem on trees. Submitted: June 2008 Reviewed: February 2009 Revised: March 2009 Accepted: Marc...
متن کاملParameterized Coloring Problems on Chordal Graphs
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a proper coloring of the graph with the given number of colors. Two parameterized versions of the problem are studied in the paper: either the number of precolored vertices or the number of colors used in the precolo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2012
ISSN: 1526-1719
DOI: 10.7155/jgaa.00258